A Dual Biogeography-Based Optimization Algorithm for Solving High-Dimensional Global Optimization Problems and Engineering Design Problems
نویسندگان
چکیده
Biogeography-based optimization (BBO) cannot effectively solve high-dimensional global problems due to its single migration mechanism and random mutation operator. To overcome these limitations, this paper propose a dual BBO based on sine cosine algorithm (SCA) dynamic hybrid mutation, named SCBBO. Firstly, the Latin hypercube sampling method is innovatively used improve initial population ergodicity. Secondly, nonlinear transformation parameter inertia weight adjustment factor are designed into position update formula of SCA make SCBBO suitable for high dimensional environments. Then, operator by combining Laplacian Gaussian which helps escape from local optima balance exploration exploitation. Finally, learning strategy integrated, so convergence accuracy further improved generating individuals. Meanwhile, A sequence model established prove can converge optimal solution with probability 1. Compared other state-of-the-art evolutionary algorithms, improves speed problems. show superiority SCBBO, performance compared 1000, 2000, 5000 10000 dimensions, respectively. The comparsions that SCBBO’s results dimensions basically same. also applied engineering design problems, simulation demonstrate proposed effective constrained
منابع مشابه
FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملA Dual-based Combinatorial Algorithm for Solving Cyclic Optimization Problems
This paper describes Patent Number U.S. 8,046,316 B2, titled “Cyclic Combinatorial Method and System”, issued by the US Patents and Trademarks Office on October 25, 2011. The patent is based on a combinatorial algorithm to solve cyclic optimization problems. First, the algorithm identifies cyclically distinct solutions of such problems by enumerating cyclically distinct combinations of the basi...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملSolving Engineering Optimization Problems by a Deterministic Global Optimization Approach
Abstract: Engineering optimization problems are normally formulated as nonlinear programming problems and adopted in a lot of research to show the effectiveness of new optimization algorithms. These problems are usually solved through deterministic or heuristic methods. Because non-convex functions exist in most engineering optimization problems that possess multiple local optima, the heuristic...
متن کاملA FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS
Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3177218